Firm Recruitment Behaviour: Sequential or Non-sequential Search?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Firm Recruitment Behaviour: Sequential or Non-Sequential Search?

Firm Recruitment Behaviour: Sequential or Non-Sequential Search? In the extensive job search literature, studies assume either sequential or non-sequential search. Which assumption is more reasonable? This paper introduces a novel method to test the hypothesis that firms search sequentially based on the relationship between the number of (rejected) job applicants and the number of employees hir...

متن کامل

Non-sequential Behaviour of Dynamic Nets

Dynamic nets are an extension of Petri nets where the net topology may change dynamically. This is achieved by allowing (i) tokens to be coloured with place names (carried on as data), (ii) transitions to designate places where to spawn new tokens on the basis of the colours in the fetched tokens, and (iii) firings to add fresh places and transitions to the net. Dynamic nets have been given ste...

متن کامل

Non-Sequential Search, Screening Externalities and the Public Good Role of Recruitment Offices

This paper focuses on a congestion externality in the labor market which is caused by non sequential search. A model is presented in which unemployment is caused by selection delays of the employers It is shown that the individual probability to get a job offer is increasing in the number of applications but that the aggregate hiring rate is decreasing in the average amount of applications per ...

متن کامل

Sequential Bayesian Search

Millions of people search daily for movies, music, and books on the Internet. Unfortunately, non-personalized exploration of items can result in an infeasible number of costly interaction steps. We study the problem of efficient, repeated interactive search. In this problem, the user is navigated to the items of interest through a series of options and our objective is to learn a better search ...

متن کامل

Discrete Sequential Search

Before the search it is impossible to predict how many looks will be necessary to locate the target. A policy is a plan of search that tells where the nth look will be made--should it be necessary. For any policy, if P ( k ) is the probabil i ty tha t the target is found on or before the kth look, C(]c) is the total cost of the first k looks, and C is the random total cost, then the expectation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Oxford Bulletin of Economics and Statistics

سال: 2013

ISSN: 0305-9049

DOI: 10.1111/obes.12027